A clustering-based surrogate-assisted evolutionary algorithm (CSMOEA) for expensive multi-objective optimization

نویسندگان

چکیده

This paper presents a novel surrogate-assisted evolutionary algorithm, CSMOEA, for multi-objective optimization problems (MOPs) with computationally expensive objectives. Considering most algorithms (SAEAs) do not make full use of population information and only in either the objective space or design independently, to address this limitation, we propose new strategy comprehensive utilization space. The proposed CSMOEA adopts an adaptive clustering divide current into good bad groups, centers are obtained, respectively. Then, bi-level sampling is select best samples both space, using distance approximated values radial basis functions. effectiveness compared five state-of-the-art on 21 widely used benchmark problems, results show high efficiency balance between convergence diversity. Additionally, applied shape blend-wing-body underwater gliders 14 decision variables two objectives, demonstrating its solving real-world engineering problems.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A multi-fidelity surrogate-model-assisted evolutionary algorithm for computationally expensive optimization problems

Integrating data-driven surrogate models and simulation models of di erent accuracies (or delities) in a single algorithm to address computationally expensive global optimization problems has recently attracted considerable attention. However, handling discrepancies between simulation models with multiple delities in global optimization is a major challenge. To address it, the two major contrib...

متن کامل

A Preference-Based Evolutionary Algorithm for Multi-Objective Optimization

In this paper, we discuss the idea of incorporating preference information into evolutionary multi-objective optimization and propose a preference-based evolutionary approach that can be used as an integral part of an interactive algorithm. One algorithm is proposed in the paper. At each iteration, the decision maker is asked to give preference information in terms of his or her reference point...

متن کامل

An Adaptive Surrogate-Assisted Strategy for Multi-Objective Optimization

1. Abstract A sequential metamodel-based optimization method is proposed for multi-objective optimization problems. The algorithm, designated as Pareto Domain Reduction, is an adaptive sampling method and an extension of the classical Domain Reduction approach (also known as the Sequential Response Surface Method). In addition to standard benchmark examples, a Multidisciplinary Design Optimizat...

متن کامل

Surrogate based Evolutionary Algorithm for Design Optimization

Optimization is often a critical issue for most system design problems. Evolutionary Algorithms are population-based, stochastic search techniques, widely used as efficient global optimizers. However, finding optimal solution to complex high dimensional, multimodal problems often require highly computationally expensive function evaluations and hence are practically prohibitive. The Dynamic App...

متن کامل

On Constraint Handling in Surrogate-Assisted Evolutionary Many-Objective Optimization

Surrogate-assisted evolutionary multiobjective optimization algorithms are often used to solve computationally expensive problems. But their efficacy on handling constrained optimization problems having more than three objectives has not been widely studied. Particularly the issue of how feasible and infeasible solutions are handled in generating a data set for training a surrogate has not rece...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Soft Computing

سال: 2023

ISSN: ['1433-7479', '1432-7643']

DOI: https://doi.org/10.1007/s00500-023-08227-4